Termination w.r.t. Q proof of /tmp/tmphj0rqr/2.32.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

=¹(x, y) → NOT(y)
=¹(x, y) → IF(x, y, not(y))
=¹(x, y) → IF(y, false, true)
NOT(x) → IF(x, false, true)
AND(x, y) → IF(x, y, false)
=¹(x, y) → IF(x, y, if(y, false, true))
IMPLIES(x, y) → IF(x, y, true)
OR(x, y) → IF(x, true, y)

The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

=¹(x, y) → NOT(y)
=¹(x, y) → IF(x, y, not(y))
=¹(x, y) → IF(y, false, true)
NOT(x) → IF(x, false, true)
AND(x, y) → IF(x, y, false)
=¹(x, y) → IF(x, y, if(y, false, true))
IMPLIES(x, y) → IF(x, y, true)
OR(x, y) → IF(x, true, y)

The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 8 less nodes.